Solving systems of linear equations with a positive definite, symmetric, but possibly ill-conditioned matrix
نویسندگان
چکیده
منابع مشابه
Implicit Gradient Neural Networks with a Positive-Definite Mass Matrix for Online Linear Equations Solving
Motivated by the advantages achieved by implicit analogue net for solving online linear equations, a novel implicit neural model is designed based on conventional explicit gradient neural networks in this letter by introducing a positive-definite mass matrix. In addition to taking the advantages of the implicit neural dynamics, the proposed implicit gradient neural networks can still achieve gl...
متن کاملA New Method for Solving Ill-conditioned Linear Systems
An accurate numerical method is established for matrix inversion. It is shown theoretically that the scheme possesses the high order of convergence of seven. Subsequently, the method is taken into account for solving linear systems of equations. The accuracy of the contributed iterative method is clarified on solving numerical examples when the coefficient matrices are ill-conditioned. All of t...
متن کاملDynamical systems method for solving ill-conditioned linear algebraic systems
A new method, the Dynamical Systems Method (DSM), justified recently, is applied to solving ill-conditioned linear algebraic system (ICLAS). The DSM gives a new approach to solving a wide class of ill-posed problems. In this paper a new iterative scheme for solving ICLAS is proposed. This iterative scheme is based on the DSM solution. An a posteriori stopping rules for the proposed method is ju...
متن کاملAn Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
Many scientific applications require one to solve successively linear systems Ax = b with different right-hand sides b and a symmetric positive definite matrix A. The conjugate gradient method applied to the first system generates a Krylov subspace which can be efficiently recycled thanks to orthogonal projections in subsequent systems. A modified conjugate gradient method is then applied with ...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1955
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1955-0074915-1